The theory of successor extended by several predicates
نویسنده
چکیده
We present a method to define unary relations P1, . . . , Pn such that the Monadic Second-Order theory of the natural integers endowed with the successor relation and P1, . . . , Pn is decidable. The main tool is a novel class of iterated pushdown automata whose transitions are controlled by tests on the store.
منابع مشابه
Feature Trees over Arbitrary Structures
This paper presents a family of rst order feature tree theories, indexed by the theory of the feature labels used to build the trees. A given feature label theory, which is required to carry an appropriate notion of sets, is conservatively extended to a theory of feature trees with the predicates xt]y (feature t leads from the root of tree x to the tree y), where we have to require t to be a gr...
متن کامل1Feature Trees over Arbitrary Structures
abstract. This paper presents a family of rst order feature tree theories, indexed by the theory of the feature labels used to build the trees. A given feature label theory, which is required to carry an appropriate notion of sets, is conservatively extended to a theory of feature trees with the predicates xt]y (feature t leads from the root of tree x to the tree y, where we require t to be a g...
متن کاملON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملDecidable Theories of the Ordering of Natural Numbers with Unary Predicates
Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order logic. Building on the modeltheoretic composition method of Shelah, we give two characterizations of the decidable theories of this form, in terms of effectiveness conditions on two types of “homogeneous sets”. We discuss the ...
متن کاملSolving the Apprentice Challenge with 3VMC
Our solution of the apprentice challenge is based on [2] and does not assume any a priori bound on the number of Job threads or on the value of the counter field. This should be contrasted with previous attempts to solve the apprentice challenge using model-checking (i.e., the “finite Apprentice”). In our solution, we use the predicates of Table 1. The set Fields contains all fields used in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006